Optimal Encoding of Partial Orders

نویسندگان

  • Andrey Mokhov
  • Ulan Degenbaev
  • Alex Yakovlev
چکیده

This paper presents a method for optimal encoding of a given set of partial orders so that a Conditional Partial Order Graph containing all of them has the least possible total count of literals in all of its vertex and arc conditions, thus leading to the smallest and fastest controller. The presented method is implemented in a software tool for automated CPOG synthesis.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Searching in Random Partially Ordered Sets

We consider the problem of searching for a given element in a partially ordered set. More precisely, we address the problem of computing efficiently near-optimal search strategies for typical partial orders. We consider two classical models for random partial orders, the random graph model and the uniform model. We shall show that certain simple, fast algorithms are able to produce nearly-optim...

متن کامل

Solving Partial Order Constraints for LPO Termination

This paper introduces a new kind of propositional encoding for reasoning about partial orders. The symbols in an unspecified partial order are viewed as variables which take integer values and are interpreted as indices in the order. For a partial order statement on n symbols each index is represented in dlog2 ne propositional variables and partial order constraints between symbols are modeled ...

متن کامل

A Batch-wise ATP Procedure in Hybrid Make-to-Order/Make-to-Stock Manufacturing Environment

Satisfying customer demand necessitates manufacturers understanding the importance of Available-To-Promise (ATP). It directly links available resources to customer orders and has significant impact on overall performance of a supply chain. In this paper, an improvement of the batch-mode ATP function in which the partial fulfillment of the orders is available will be proposed. In other words, in...

متن کامل

Full Glowworm Swarm Optimization Algorithm for Whole-Set Orders Scheduling in Single Machine

By analyzing the characteristics of whole-set orders problem and combining the theory of glowworm swarm optimization, a new glowworm swarm optimization algorithm for scheduling is proposed. A new hybrid-encoding schema combining with two-dimensional encoding and random-key encoding is given. In order to enhance the capability of optimal searching and speed up the convergence rate, the dynamical...

متن کامل

Optimal Decisions in a Dual-channel Supply Chain for the Substitute Products with the Special Orders under DisruptionRisk and Brand Consideration

In this paper, a three-echelon supply chain , including two producers, distributor and retailer who produce products in different brands have been considered. Any manufacturer, has a separate channel and the exclusive retailer offers their products, which have been prepared from the distributor (exclusive market) with discount or other manufacturer. In this paper pricing decisions on substitute...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009